Non-separated cuttings of connected point sets
نویسندگان
چکیده
منابع مشابه
Separated finitely supported $Cb$-sets
The monoid $Cb$ of name substitutions and the notion of finitely supported $Cb$-sets introduced by Pitts as a generalization of nominal sets. A simple finitely supported $Cb$-set is a one point extension of a cyclic nominal set. The support map of a simple finitely supported $Cb$-set is an injective map. Also, for every two distinct elements of a simple finitely supported $Cb$-set, there exists...
متن کاملFour-connected triangulations of planar point sets
In this paper, we consider the problem of determining in polynomial time whether a given planar point set P of n points admits 4-connected triangulation. We propose a necessary and sufficient condition for recognizing P , and present an O(n) algorithm of constructing a 4-connected triangulation of P . Thus, our algorithm solves a longstanding open problem in computational geometry and geometric...
متن کاملConnected Rectilinear Graphs on Point Sets
Let V be a set of n points in R. We study the question whether there exists an orientation such that V is the vertex set of a connected rectilinear graph in that orientation. A graph is rectilinear if its edges are straight line segments in d pairwise perpendicular directions. We prove that at most one such orientation can be possible, up to trivial rotations of 90◦ around some axis. In additio...
متن کاملConcerning Connected and Regular Point Sets
In this paper an extension will be given of a theorem of the author'sf which states that if A and B are any two points of a continuous curve M, and K denotes the set of all those points of M which separate} A and B in M, then K+A+B is a closed set of points. I t will be shown that if A and B are any two points of any connected and regular (connected im kleinen) point set M, and K denotes the se...
متن کاملNon-Partitionable Point Sets
Let S be a finite set of n points in d-dimensional space. S is e.(n)-partitionable if there exists a set of d mutually intersecting hyperplanes that divide d-space into 2d open regions, no 2d 1 of which together contain more than o(n) points of S. Willard (1982) has shown that every set in 2-space is :n-partitionable. Yao (1983) has shown that every set in 3-space is gn-partitionable. It is sho...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions of the American Mathematical Society
سال: 1931
ISSN: 0002-9947
DOI: 10.1090/s0002-9947-1931-1501599-5